Packing six T-joins in plane graphs
نویسندگان
چکیده
Let G be a plane graph and T an even subset of its vertices. It has been conjectured that if all T -cuts of G have the same parity and the size of every T -cut is at least k, then G contains k edge-disjoint T -joins. The case k = 3 is equivalent to the Four Color Theorem, and the cases k = 4, which was conjectured by Seymour, and k = 5 were proved by Guenin. We settle the next open case k = 6.
منابع مشابه
The Cycling Property for the Clutter of Odd st-Walks
A binary clutter is cycling if its packing and covering linear program have integral optimal solutions for all Eulerian edge capacities. We prove that the clutter of odd stwalks of a signed graph is cycling if and only if it does not contain as a minor the clutter of odd circuits of K5 nor the clutter of lines of the Fano matroid. Corollaries of this result include, of many, the characterizatio...
متن کاملPacking odd T-joins with at most two terminals
Take a graph G, an edge subset Σ ⊆ E(G), and a set of terminals T ⊆ V (G) where |T | is even. The triple (G,Σ, T ) is called a signed graft. A T -join is odd if it contains an odd number of edges from Σ. Let ν be the maximum number of edge-disjoint odd T -joins. A signature is a set of the form Σ4δ(U) where U ⊆ V (G) and |U ∩ T | is even. Let τ be the minimum cardinality a T -cut or a signature...
متن کاملUndirected distances and the postman-structure of graphs
We present some properties of the distance function and of shortest paths in + l-weighted undirected graphs. These extend some basic results, e.g., on matchings, on the Chinese postman problem, and on plane multicommodity flows. Furthermore, distances turn out to be efficient tools to generalize the matching-structure of graphs to a structure related to subgraphs having only parity constraints ...
متن کاملPfaffian graphs, T -joins and crossing numbers
We characterize Pfaffian graphs in terms of their drawings in the plane. We generalize the techniques used in the proof of this characterization, and prove a theorem about the numbers of crossings in T -joins in different drawings of a fixed graph. As a corollary we give a new proof of a theorem of Kleitman on the parity of crossings in drawings of K2j+1 and K2j+1,2k+1.
متن کاملFractional Packing of T-Joins
Given a graph with nonnegative capacities on its edges, it is well known that the capacity of a minimum T -cut is equal to the value of a maximum fractional packing of T -joins. Padberg-Rao’s algorithm finds a minimum capacity T -cut but it does not produce a T -join packing, we present a polynomial combinatorial algorithm for finding an optimal T -join packing.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 116 شماره
صفحات -
تاریخ انتشار 2016